NONSTANDARD RUNS OF FLOYD-PROVABLE PROGRAMSNEMETI I.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 186-204; BIBL. 23 REF.Conference Paper

ADI: AUTOMATIC DERIVATION OF INVARIANTSTAMIR M.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 1; PP. 40-48; BIBL. 40 REF.Article

PROGRAM CORRECTNESS: ON INDUCTIVE ASSERTION METHODSKING JC.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 5; PP. 465-479; BIBL. 6 REF.Article

A NOTE ON SYNTHESIS OF INDUCTIVE ASSERTIONSBASU SK.1980; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1980; VOL. 6; NO 1; PP. 32-39; BIBL. 18 REF.Article

CONSEQUENCE VERIFICATION OF FLOWCHARTSCLARK KL; VAN EMDEN MH.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 1; PP. 52-60; BIBL. 18 REF.Article

A LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHSADI SHAMIR.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 645-655; BIBL. 7 REF.Article

COMPLEXITY OF SYNTHESIZING INDUCTIVE ASSERTIONS.WEGBREIT B.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 504-512; BIBL. 19 REF.Article

INDUCTION AS THE BASIS FOR PROGRAM VERIFICATION.REYNOLDS C; YEH RT.1976; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1976; VOL. 2; NO 4; PP. 244-252; BIBL. 6 REF.Article

INTERMITTENT-ASSERTION METHOD AS A STRUCTURAL INDUCTIONVOSATKA K.1979; KYBERNETIKA; CSK; DA. 1979; VOL. 15; NO 2; PP. 122-135; BIBL. 7 REF.Article

PROSPECTS AND LIMITATIONS OF AUTOMATIC ASSERTION GENERATION FOR LOOP PROGRAMS.MISRA J.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 718-729; BIBL. 10 REF.Article

AXIOMS FOR TOTAL CORRECTNESS.SOKOLOWSKI S.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 9; NO 1; PP. 61-77; BIBL. 7 REF.Article

ILP 2003 : inductive logic programming (Szeged, 29 September - 1 October 2003)Horvath, Tamas; Yamamoto, Akihiro.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20144-0, X, 400 p, isbn 3-540-20144-0Conference Proceedings

On the strength of «sometimes» and «always» in program verificationCSIRMAZ, L.Information and control. 1983, Vol 57, Num 2-3, pp 165-179, issn 0019-9958Article

An inductive assertion method for register transfer level design verificationPITCHUMANI, V; STABLER, E. P.IEEE transactions on computers. 1983, Vol 32, Num 12, pp 1073-1080, issn 0018-9340Article

AN EXERCISE IN AUTOMATIC PROGRAM VERIFICATIONPOLAK W.1979; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1979; VOL. 5; NO 5; PP. 453-458; BIBL. 8 REF.Article

How to prove inductive theorems? QUODLIBET!AVENHAUS, Jürgen; KÜHLER, Ulrich; SCHMIDT-SAMOA, Tobias et al.Lecture notes in computer science. 2003, pp 328-333, issn 0302-9743, isbn 3-540-40559-3, 6 p.Conference Paper

TEST DATA AS AN AID IN PROVING PROGRAM CORRECTNESS.GELLER M.1976; IN: CONF. REC. ACM SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 209-218; BIBL. 19 REF.Conference Paper

THE USE OF HIGHER ORDER LOGIC IN PROGRAM VERIFICATION.ERNST GW; HOOKWAY RJ.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 8; PP. 844-851; BIBL. 18 REF.Article

IMPLEMENTATION OF AN ARRAY BOUND CHECKER.SUZUKI N; ISHIHATA K.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 132-142; BIBL. 10 REF.Conference Paper

ON THE PROOF OF CORRECTNESS OF A CALENDAR PROGRAMLAMPORT L.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 10; PP. 554-556; BIBL. 4 REF.Article

RECURSIVE PROGRAMS AS FUNCTIONS IN A FIRST ORDER THEORYCARTWRIGHT R; MCCARTHY J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 75; PP. 576-629; BIBL. 2 P.Conference Paper

A CALCULUS FOR PROVING PROPERTIES OF WHILE-PROGRAMSGLASNER I; LOECKX J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 75; PP. 252-282; BIBL. 9 REF.Conference Paper

TEST DATA AS AN AID IN PROVING PROGRAM CORRECTNESS.GELLER M.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 5; PP. 368-375; BIBL. 20 REF.Article

SUBGOAL INDUCTION.MORRIS JH JR; WEGBREIT B.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 4; PP. 209-222; BIBL. 20 REF.Article

REACHABILITY ANALYSIS WITH ASSERTION SYSTEMMUELLER H.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 214-223; BIBL. 4 REF.Conference Paper